ar X iv : 1 30 5 . 70 50 v 1 [ cs . L O ] 3 0 M ay 2 01 3 Modelling , Reduction and Analysis of Markov Automata ( extended version
نویسندگان
چکیده
Markov automata (MA) constitute an expressive continuoustime compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive power has thus far precluded them from effective analysis by probabilistic (and statistical) model checkers, stochastic game solvers, or analysis tools for Petri net-like formalisms. This paper presents the foundations and underlying algorithms for efficient MA modelling, reduction using static analysis, and most importantly, quantitative analysis. We also discuss implementation pragmatics of supporting tools and present several case studies demonstrating feasibility and usability of MA in practice.
منابع مشابه
ar X iv : 1 70 5 . 07 33 9 v 1 [ cs . A I ] 2 0 M ay 2 01 7 Combining tabu search and graph reduction to solve the maximum balanced biclique problem
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs fro...
متن کاملar X iv : 1 30 4 . 51 85 v 2 [ cs . L O ] 3 0 A pr 2 01 3 Temporal Description Logic for Ontology - Based Data Access ( Extended
Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling. To this end, we design a temporal description logic, TQL, that extends the standard ontology language OWL 2 QL, provides basic means for temporal conceptual modelling and ensures first-order rewritability of conjunctive queries for suitably defined ...
متن کاملar X iv : c on d - m at / 9 30 50 01 v 1 3 M ay 1 99 3 One - dimensional asymmetrically coupled maps with defects
متن کامل
Derived-Term Automata for Extended Weighted Rational Expressions
We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational expansions. We introduce an inductive algorithm to compute the expansion of an expression from which the automaton follows. This algorithm is independent of the ...
متن کاملar X iv : 0 70 5 . 01 50 v 1 [ cs . C E ] 1 M ay 2 00 7 COMPARISON OF DISCRETE AND CONTINUOUS WAVELET TRANSFORMS
In this paper we outline several points of view on the interplay between discrete and continuous wavelet transforms; stressing both pure and applied aspects of both. We outline some new links between the two transform technologies based on the theory of representations of generators and relations. By this we mean a finite system of generators which are represented by operators in Hilbert space....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013